package io.tec.cloud.algorithm.c11_v20220711;

import java.util.LinkedList;
import java.util.Queue;

/**
 * 62	11_2	11	2	11二叉树常见面试题（下）	实现二叉树的按层遍历
 *
 * @author tec-nine
 */
public class Code11_2_LevelTraversalBT {

    static class Node {
        private int value;
        private Node left;
        private Node right;

        public Node(int v) {
            this.value = v;
        }
    }

    public static void level(Node head) {
        Queue<Node> queue = new LinkedList<>();
        queue.add(head);
        while (!queue.isEmpty()) {
            Node cur = queue.poll();
            System.out.println(cur.value);
            if (cur.left != null) {
                queue.add(cur.left);
            }
            if (cur.right != null) {
                queue.add(cur.right);
            }
        }
    }

    public static void main(String[] args) {
        Node head = new Node(1);
        head.left = new Node(2);
        head.right = new Node(3);
        head.left.left = new Node(4);
        head.left.right = new Node(5);
        head.right.left = new Node(6);
        head.right.right = new Node(7);

        level(head);
        System.out.println("========");
    }

}
